From Generalized Gauss Bounds to Distributionally Robust Fault Detection with Unimodality Information

نویسندگان

چکیده

The need for exact distributions in probabilistic fault detection design is hardly fulfilled. recent moment-based distributionally robust (DRFD) secures robustness against inexact but suffers from over-pessimism. To address this issue, we develop a new DRFD scheme by using unimodality, ubiquitous property of real-life distributions. evaluate worst-case false alarm rates, generalized Gauss bound first attained, which less conservative than known Chebyshev bounds that underpin DRFD. This also yields analytical solutions to problems, are suboptimal provably ones disregarding unimodality. A tightened further derived assuming bounded uncertainty, based on convex programming approximation problems developed. Results physical system data elucidate the proposed can reduce conservatism unimodality information, and attaining better robustness-sensitivity trade-off prevalent data-centric with moderate sample sizes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Dynamic Programming By Minimizing Distributionally Robust Bounds

Approximate dynamic programming is a popular method for solving large Markov decision processes. This paper describes a new class of approximate dynamic programming (ADP) methods— distributionally robust ADP—that address the curse of dimensionality by minimizing a pessimistic bound on the policy loss. This approach turns ADP into an optimization problem, for which we derive new mathematical pro...

متن کامل

Distributionally Robust Project Crashing with Partial or No Correlation Information

Crashing is a method for optimally shortening the project makespan by reducing the time of one or more activities in a project network by allocating resources to it. Activity durations are however uncertain and techniques in stochastic optimization, robust optimization and distributionally robust optimization have been developed to tackle this problem. In this paper, we study a class of distrib...

متن کامل

Distributionally Robust Stochastic Programming

Abstract. In this paper we study distributionally robust stochastic programming in a setting 7 where there is a specified reference probability measure and the uncertainty set of probability mea8 sures consists of measures in some sense close to the reference measure. We discuss law invariance of 9 the associated worst case functional and consider two basic constructions of such uncertainty set...

متن کامل

From Data to Decisions: Distributionally Robust Optimization is Optimal

We study stochastic programs where the decision-maker cannot observe the distribution of the exogenous uncertainties but has access to a finite set of independent samples from this distribution. In this setting, the goal is to find a procedure that transforms the data to an estimate of the expected cost function under the unknown data-generating distribution, i.e., a predictor, and an optimizer...

متن کامل

Distributionally Robust Logistic Regression

This paper proposes a distributionally robust approach to logistic regression. We use the Wasserstein distance to construct a ball in the space of probability distributions centered at the uniform distribution on the training samples. If the radius of this ball is chosen judiciously, we can guarantee that it contains the unknown datagenerating distribution with high confidence. We then formulat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2022

ISSN: ['0018-9286', '1558-2523', '2334-3303']

DOI: https://doi.org/10.1109/tac.2022.3220180